Modified Particle Swarm Optimization Combined with Trigonometric Function and Variable Neighborhood Search

نویسنده

  • Wenxue Zhang
چکیده

Based on the inertia weight and acceleration coefficients of trigonometric function and variable neighborhood search, a modified particle swarm optimization is discussed. The modified PSO with the parameters of the trigonometric function has powerful global exploration at the beginning and ending of the evolution, and strongly local exploitation in the interim of run. Through analyzing the behavior of the PSO, three novel heuristic neighborhood search rules are suggested to enhance the robustness and convergence. The proposed approach demonstrates its superiority in convergence, robustness and solution quality with the experiment tested on the benchmark multimodal function.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A hybrid Particle Swarm Optimization - Variable Neighborhood Search algorithm for Constrained Shortest Path problems

In this paper, a well known NP-hard problem, the Constrained Shortest Path problem, is studied. As efficient metaheuristic approaches are required for its solution, a new hybridized version of Particle Swarm Optimization algorithm with Variable Neighborhood Search is proposed for solving this significant combinatorial optimization problem. Particle Swarm Optimization (PSO) is a population-based...

متن کامل

Fuzzy particle swarm optimization with nearest-better neighborhood for multimodal optimization

In the last decades, many efforts have been made to solve multimodal optimization problems using Particle Swarm Optimization (PSO). To produce good results, these PSO algorithms need to specify some niching parameters to define the local neighborhood. In this paper, our motivation is to propose the novel neighborhood structures that remove undesirable niching parameters without sacrificing perf...

متن کامل

A Particle Swarm Optimization Approach for the Earliness-Tardiness No-Wait Flowshop Scheduling Problem

In this researcha particle swarm optimization (PSO) algorithm is proposedfor no-wait flowshopsequence dependent setuptime scheduling problem with weighted earliness-tardiness penalties as the criterion ( | , | ∑ " ).The smallestposition value (SPV) rule is applied to convert the continuous value of position vector of particles in PSO to job permutations.A timing algorithm is generated to find t...

متن کامل

Diversified Particle Swarm Optimization for Hybrid Flowshop Scheduling

The aim of this paper is to propose a new particle swarm optimization algorithm to solve a hybrid flowshop scheduling with sequence-dependent setup times problem, which is of great importance in the industrial context. This algorithm is called diversified particle swarm optimization algorithm which is a generalization of particle swarm optimization algorithm and inspired by an anarchic society ...

متن کامل

A Modified Discreet Particle Swarm Optimization for a Multi-level Emergency Supplies Distribution Network

Currently, the research of emergency supplies distribution and decision models mostly focus on deterministic models and exact algorithm. A few of studies have been done on the multi-level distribution network and matheuristic algorithm. In this paper, random processes theory is adopted to establish emergency supplies distribution and decision model for multi-level network. By analyzing the char...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • JCP

دوره 7  شماره 

صفحات  -

تاریخ انتشار 2012